On the Ranks of Elliptic Curves with Isogenies
نویسنده
چکیده
In recent years, the question of whether the ranks of elliptic curves defined over Q are unbounded has garnered much attention. One can create refined versions of this question by restricting one’s attention to elliptic curves over Q with a certain algebraic structure, e.g., with a rational point of a given order. In an attempt to gather data about such questions, we look for examples of elliptic curves over Q with an n-isogeny and rank as large as possible. To do this, we use existing techniques due to Rogers, Rubin, Silverberg, and Nagao and develop a new technique (based on an observation made by Mazur) that is more computationally feasible when the naive heights of the elliptic curves are large.
منابع مشابه
Diffie-Hellman type key exchange protocols based on isogenies
In this paper, we propose some Diffie-Hellman type key exchange protocols using isogenies of elliptic curves. The first method which uses the endomorphism ring of an ordinary elliptic curve $ E $, is a straightforward generalization of elliptic curve Diffie-Hellman key exchange. The method uses commutativity of the endomorphism ring $ End(E) $. Then using dual isogenies, we propose...
متن کاملOn Tate-Shafarevich Groups of some Elliptic Curves
Generalizing results of Stroeker and Top we show that the 2-ranks of the TateShafarevich groups of the elliptic curves y = (x + k)(x + k) can become arbitrarily large. We also present a conjecture on the rank of the Selmer groups attached to rational 2-isogenies of elliptic curves. 1991 Mathematics Subject Classification: 11 G 05
متن کاملIsogenies on Edwards and Huff curves
Isogenies of elliptic curves over finite fields have been well-studied, in part because there are several cryptographic applications. Using Vélu’s formula, isogenies can be constructed explicitly given their kernel. Vélu’s formula applies to elliptic curves given by a Weierstrass equation. In this paper we show how to similarly construct isogenies on Edwards curves and Huff curves. Edwards and ...
متن کاملIsogeny cordillera algorithm to obtain cryptographically good elliptic curves
The security of most elliptic curve cryptosystems is based on the intractability of the Elliptic Curve Discrete Logarithm Problem (ECDLP). Such a problem turns out to be computationally unfeasible when elliptic curves are suitably chosen. This paper provides an algorithm to obtain cryptographically good elliptic curves from a given one. The core of such a procedure lies on the usage of successi...
متن کاملAnalogues of Vélu's formulas for isogenies on alternate models of elliptic curves
Isogenies are the morphisms between elliptic curves, and are accordingly a topic of interest in the subject. As such, they have been wellstudied, and have been used in several cryptographic applications. Vélu’s formulas show how to explicitly evaluate an isogeny, given a specification of the kernel as a list of points. However, Vélu’s formulas only work for elliptic curves specified by a Weiers...
متن کامل